Correspondence Theorem
The correspondence theorem in group theory gives a classification of all subgroups of a quotient group in terms of subgroups of the group that it is a quotient of.
Theorem
Given a group with a normal subgroup , there is a bijection between the set of subgroups of containing and the subgroups of
given by
This gives us a full classification of all the subgroups of the quotient group . In particular they are of the form where .
Theorem
The correspondence above satisfies
- is a normal subgroup of if and only if is a normal subgroup of .
This list is far from exhaustive; a lot of the structure of the subgroups of the initial group are preserved in the quotient.
Intuitively, consider a subgroup which contains but is containing in , and this subgroup corresponds with the set of cosets of inside it.
In the following diagram, we have on the left partitioned into cosets of , with being a subgroup containing some number of those cosets. The way nicely contains an integer number of cosets is a consequence of the first result we prove below.
The set of elements in , the green rectangle on the left, corresponds with the set of cosets of in , marked in green on the right.
 1.png)
This correspondence means that our bijection maps to , and hence similarly it would map different selections of to the corresponding as follows:
 2.png)
This point is made simply to make it clear that the mapping is not a correspondence between and (in terms of their elements). It's a correspondence between all such subgroups and .
We now proof the first result.
Proof
Denote the bijection by such that .
First, note that because for , we have by this result that and hence is a well defined group. Furthermore, because , and these groups use the same operation, is indeed a subgroup of . As such, is a well defined map.
Now, to prove is surjective, define for each , a set . We will prove is a subgroup of using the subgroup tests given . Let , hence , and consider that
and thus .
For injectivity, suppose that and are distinct subgroups of containing . Without loss of generality, assume there exists an . Assume now by way of contradiction that , that is, for some . This however implies that , and thus that for some . This means that and hence , a contradiction. Therefore and .